Flexible Protein Folding by Ant Colony Optimization

Protein folding in hydrophobic-polar lattice model: a flexible ant-colony optimization approach.

This paper proposes a flexible ant colony (FAC) algorithm for solving protein folding problems based on the hydrophobic-polar square lattice model. Collaborations of novel pheromone and heuristic strategies in the proposed algorithm make it more effective in predicting structures of proteins compared with other state-of-the-art algorithms.

Aco-metaheuristic for 3d-hp Protein Folding Optimization

Protein Folding is a broad research field in computational Biology, Molecular Biology and Bioinformatics. Protein Folding Optimization is one of the NP-hard problems. Bio-inspired metaheuristics plays a major role in solving the protein folding optimization which can mimic the insect’s problem solving abilities like foraging, nest building and mating. In this paper Ant Colony Optimization (ACO)...

An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem

A Hybrid Population based ACO Algorithm for Protein Folding

A hybrid population based Ant Colony Optimization (ACO) algorithm PFold-P-ACO for protein folding in the HP model is proposed in this paper. This is the first population based ACO algorithm in the bioinformatics. It is shown experimentally that the algorithms achieves on nearly all test sequences at least comparable results to other state of the art algorithms. Compared to the state of the art ...

Competitive Imperialistic Approach for Protein Folding

The protein folding problem is a fundamental problem in computational molecular biology and biochemical physics which led us to understand the function of a given sequence.The problem is NP-hard and the standard computational approach are not suitable to obtain the enough accurate structure in the huge conformation space. Simplied models such as hydrophobicpolar (HP) model have become one of th...